Families of LDPC Codes Derived from Nonprimitive BCH Codes and Cyclotomic Cosets
نویسنده
چکیده
Low-density parity check (LDPC) codes are an important class of codes with many applications. Two algebraic methods for constructing regular LDPC codes are derived – one based on nonprimitive narrow-sense BCH codes and the other directly based on cyclotomic cosets. The constructed codes have high rates and are free of cycles of length four; consequently, they can be decoded using standard iterative decoding algorithms. The exact dimension and bounds for the minimum distance and stopping distance are derived. These constructed codes can be used to derive quantum error-correcting codes.
منابع مشابه
Dimension of nonbinary antiprimitive BCH codes
Bose-Chaudhuri-Hocquenghem (BCH) codes have been widely employed in satellite communications, compact disc players, DVDs, disk drives, solidstate drives, two-dimensional bar codes and in cryptography more recently. However, there is only a little known about primitive BCH codes, let alone nonprimitive ones. In this paper, dimension of a special class of nonprimitive BCH codes of length n = q + ...
متن کاملOn Quantum and Classical Error Control Codes: Constructions and Applications
It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. For instance, Shor’s algorithm is able to factor large integers in polynomial time on a quantum computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a formidable task to build a quantum computer, since...
متن کاملOn cyclotomic cosets and code constructions
New properties of q-ary cyclotomic cosets modulo n = qm − 1, where q ≥ 3 is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of classical cyclic codes can be computed. As an application, new families of nonbinary Calderbank-Shor-Steane (CSS) quantum codes as well as new families of convolutional ...
متن کاملSome codes related to BCH-codes of low dimension
We construct a large number of record-breaking binary, ternary and quaternary codes. Our methods involve the study of BCH-codes over larger fields, concatenation, construction X and variants of the Griesmer construction (residual codes). 1 Review of the theory Let IFq be the ground field, F = IFq2 . Denote the interval {i, i + 1, . . . , j} ⊂ ZZ/(q−1)ZZ by [i, j]. Let A = [i, j] ⊂ ZZ/(q−1)ZZ. I...
متن کاملGF(2m) Low-Density Parity-Check Codes Derived from Cyclotomic Cosets
Based on the ideas of cyclotomic cosets, idempotents and Mattson-Solomon polynomials, we present a new method to construct GF(2m ), where m > 0 cyclic low-density paritycheck codes. The construction method produces the dual code idempotent which is used to define the parity-check matrix of the low-density parity-check code. An interesting feature of this construction method is the ability to in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0802.4079 شماره
صفحات -
تاریخ انتشار 2008